GRIS: Computing traditional argumentation semantics through numerical iterations
نویسندگان
چکیده
This paper provides an outline of the Gabbay-Rodrigues Iterative Solver (GRIS). The solver can be used in decision and enumeration problems of the grounded and preferred semantics.
منابع مشابه
Introducing EqArgSolver: An argumentation solver using equational semantics
In this paper we introduce EqArgSolver, an argumentation solver using equational semantics. EqArgSolver is based on the prototype GRIS submitted to the first International Competition on Computational Models of Argumentation, but provides two major advancements over GRIS. Firstly, it uses the much more e cient discrete version of the Gabbay-Rodrigues Iteration Schema [7], and secondly, it requi...
متن کاملOn the Complexity of Computing the Justification Status of an Argument
Motivation We adress the problem of: Determining the acceptance status of an argument in abstract argumentation (Given a semantics for computing the extensions). Motivation We adress the problem of: Determining the acceptance status of an argument in abstract argumentation (Given a semantics for computing the extensions). Traditional: Skeptical and/or Credulous Acceptance. Wu and Caminada recen...
متن کاملOn the Input/Output behavior of argumentation frameworks
This papers tackles the fundamental questions arising when looking at argumentation frameworks as interacting components, characterized by an Input/Output behavior, rather than as isolated monolithical entities. This modeling stance arises naturally in some application contexts, like multi-agent systems, but, more importantly, has a crucial impact on several general application-independent issu...
متن کاملCredulous Acceptability in Probabilistic Abstract Argumentation: Complexity Results
Probabilistic abstract argumentation combines Dung’s abstract argumentation framework with probability theory in order to model uncertainty in argumentation. In this setting, we address the fundamental problem of computing the probability that an argument is (credulously) acceptable according to a given semantics. Specifically, we focus on the most popular semantics (i.e., admissible, stable, s...
متن کاملComputing Science On the Equivalence between Logic Programming Semantics and Argumentation Semantics
In the current paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We observe that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) is able to serve as a basis for describing various equivalences between logic programming semantics and argumentation se...
متن کامل